The Evolutionary-Gradient-Search Procedure
نویسنده
چکیده
The application of a reasonable selection scheme plays an essential role in virtually all evolutionary algorithms. By not considering less-fit individuals, however, the algorithm discards valuable information about the fitness function. This paper explores to which extent a hybrid method, the evolutionary-gradient-search procedure, that applies a global operator to all offspring can be beneficially used in the field of continuous parameter optimization. Experiments show that on some test functions, the hybrid method yields faster convergence than pure evolution strategies, but that on other test functions, the procedure exhibits similar deficiencies as steepest-descent methods.
منابع مشابه
Inverse Mutations: Making the Evolutionary-Gradient-Search Procedure Noise Robust
ABSTRACT Recent advances in the theory of evolutionary algorithms have indicated that a hybrid method known as the evolutionary-gradient-search procedure yields superior performance in comparison to contemporary evolution strategies. But the theoretical analysis also indicates a noticeable performance loss in the presence of noise (i.e., noisy fitness evaluations). This paper aims at understand...
متن کاملThe Evolutionary-Gradient-Search Procedure in Theory and Practice
The pertinent literature controversially discusses in which respects evolutionary algorithms differ from classical gradient methods. This chapter presents a hybrid, called the evolutionary-gradient-search procedure, that uses evolutionary variations to estimate the gradient direction in which it then performs an optimization step. Both standard benchmarks and theoretical analyses suggest that t...
متن کاملEvolutionary algorithms and gradient search: similarities and differences
Classical gradient methods and evolutionary algorithms represent two very different classes of optimization techniques that seem to have very different properties. This paper discusses some aspects of some “obvious” differences and explores to what extent a hybrid method, the evolutionary-gradient-search procedure, can be used beneficially in the field of continuous parameter optimization. Simu...
متن کاملNovel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection
In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...
متن کاملA Parallel Evolutionary Method for Physical Mapping of Chromosomes
Reconstructing a physical map of a chromosome from a genomic library presents a central com putational problem in genetics Physical map reconstruction in the presence of errors is a prob lem of high computational complexity A parallel evolutionary method for a maximum likelihood estimation based approach to physical map reconstruction is presented The estimation procedure entails gradient desce...
متن کامل